Primes and Polynomials With Restricted Digits
نویسندگان
چکیده
Abstract Let $q$ be a sufficiently large integer, and $a_0\in \{0,\dots ,q-1\}$. We show there are infinitely many prime numbers that do not have the digit $a_0$ in their base expansion. Similar results obtained for values of polynomial (satisfying necessary local conditions) if multiple digits excluded.
منابع مشابه
Primes with an Average Sum of Digits
The main goal of this paper is to provide asymptotic expansions for the numbers #{p 6 x : p prime, sq(p) = k} for k close to ((q − 1)/2) logq x, where sq(n) denotes the q-ary sum-of-digits function. The proof is based on a thorough analysis of exponential sums of the form ∑ p6x e(αsq(p)) (the sum is restricted to p prime), where we have to extend a recent result by the second two authors.
متن کاملPrescribing the Binary Digits of Primes
We present a new result on counting primes p < N = 2 for which r (arbitrarily placed) digits in the binary expansion of p are specified. Compared with earlier work of Harman and Katai, the restriction on r is relaxed to r < c ( n log n )4/7 . This condition results from the estimates of Gallagher and Iwaniec on zero-free regions of L-functions with ‘powerful’ conductor. (0). Summary This work i...
متن کاملNullspace-primes and Fibonacci Polynomials
A nonzero m x n (0, 1)-matrix A is called a nullspace matrix If each entry (/', j) of A has an even number of l's in the set of entries consisting of (/, j) and its rectilinear neighbors. It is called a nullspace matrix since the existence of an m x n nullspace matrix implies the closed neighborhood matrix of the mxn grid graph Is singular over GF(2). By closed neighborhood matrix, we mean the ...
متن کاملOptimal Primitive Sets with Restricted Primes
A set of natural numbers is primitive if no element of the set divides another. Erdős conjectured that if S is any primitive set, then X
متن کاملTotally Ramified Primes and Eisenstein Polynomials
is Eisenstein at a prime p when each coefficient ci is divisible by p and the constant term c0 is not divisible by p 2. Such polynomials are irreducible in Q[T ], and this Eisenstein criterion for irreducibility is the way nearly everyone first meets Eisenstein polynomials. Here, we will show Eisenstein polynomials are closely related to total ramification of primes in number fields. Let K be a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2021
ISSN: ['1687-0247', '1073-7928']
DOI: https://doi.org/10.1093/imrn/rnab002